High Performance PPMC Compression Algorithm
نویسنده
چکیده
It has been demonstrated with recent software implementations of context modeling the capability of PPM (Prediction by Partial Matching) [1] type of algorithms to achieve very high compression rates. However, the cost is high in terms of computational complexity and low speed. Hardware implementations of compression algorithms are capable of increasing compression speed by at least an order of magnitude compared with same compression methods implemented in software. In this paper we investigate and study the issues related to simplification of one PPM type of algorithms, the PPMC [2] to achieve high performance.
منابع مشابه
Semantically Motivated Improvements for PPM Variants
The on-line sequence modelling algorithm `Prediction by Partial Matching' (PPM) has set the performance standard in lossless data compression research since Moffat's 1990 implementation, PPMC. Despite intense research activity, only Howard's 1993 escape-count update mechanism `D' has provided any consistent, order-independent performance improvement to PPMC (about 1%). Most notably, the recentl...
متن کاملNative Language Identification with PPM
This paper reports on our work in the NLI shared task 2013 on Native Language Identification. The task is to automatically detect the native language of the TOEFL essays authors in a set of given test documents in English. The task was solved by a system that used the PPM compression algorithm based on an n-gram statistical model. We submitted four runs; word-based PPMC algorithm with normaliza...
متن کاملDesign and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding
We give a detailed algorithm for fast text compression. Our algorithm, related to the PPM method, simpli es the modeling phase by eliminating the escape mechanism and speeds up coding by using a combination of quasi-arithmetic coding and Rice coding. We provide details of the use of quasi-arithmetic code tables, and analyze their compression performance. Our Fast PPM method is shown experimenta...
متن کاملText Compression Via Alphabet Re-Representation
This article introduces the concept of alphabet re-representation in the context of text compression. We consider re-representing the alphabet so that a representation of a character reflects its properties as a predictor of future text. This enables us to use an estimator from a restricted class to map contexts to predictions of upcoming characters. We describe an algorithm that uses this idea...
متن کاملUnbounded Length Contexts for PPM
The PPM data compression scheme has set the performance standard in lossless compression of text throughout the past decade. PPM is a "nite-context statistical modelling technique that can be viewed as blending together several "xed-order context models to predict the next character in the input sequence. This paper gives a brief introduction to PPM, and describes a variant of the algorithm, ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003